Representing regular Kleene algebras by tolerance-based rough sets
نویسندگان
چکیده
We show that any regular Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra defined by a tolerance induced by an irredundant covering.
منابع مشابه
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [23] are modelled in a generalized setting with set functors. Fu...
متن کاملFeasibly Reducing KAT Equations to KA Equations
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...
متن کاملA Logic for Rough Sets
The collection of all subsets of a set forms a Boolean algebra under the usual set theoretic operations, while the collection of rough sets of an approximation space is a regular double Stone algebra [24]. The appropriate class of algebras for classical propositional logic are Boolean algebras, and it is reasonable to assume that regular double Stone algebras are a class of algebras appropriate...
متن کاملAn Evaluation of Automated Theorem Proving in Regular Algebra
Introduction The Isabelle/HOL environment [8] combines the power of automated reasoning with higher-order features for theory engineering and proof management. Its built-in Sledgehammer tool integrates state of the art ATP and SMT tools, allowing for powerful automated reasoning in proofs [2]. Theory engineering features such as typeclasses and locales support the effective design of large theo...
متن کاملAnd Damien Pous A
Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations. We consider Kleene allegories, i.e., Kleene algebras with two additional operations and a constant which are natural in binary relation models: inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.09847 شماره
صفحات -
تاریخ انتشار 2016